Search

Results: 1
Experimental Programming of Genetic Algorithms for the “Casse-Tête” Problem
The Casse-tête board puzzle consists of an n×n grid covered with n^2 tokens. m<n^2 tokens are deleted from the grid so that each row and column of the grid contains an even number of remaining tokens. The size of the search...
Published by: IGI Global